A non improving simplex algorithm for transportation problems
نویسندگان
چکیده
منابع مشابه
A Dual Simplex Algorithm for the Two-step Transportation Problem
An algorithm is developd from the associated generator trees of basic dual solutions of a two-step transportation problem. This is completely appropiate for the “Balinski signature method” for the obtention of prime solutions of the two-step transportation problem
متن کاملParticle Swarm Optimization Algorithm for Transportation Problems
Particle swarm optimization (PSO) is a newer evolutionary computational method than genetic algorithm and evolutionary programming. PSO has some common properties of evolutionary computation like randomly searching, iteration time and so on. However, there are no crossover and mutation operators in the classical PSO. PSO simulates the social behavior of birds: Individual birds exchange informat...
متن کاملA Lagrangian Decomposition Algorithm for Robust Green Transportation Location Problem
In this paper, a green transportation location problem is considered with uncertain demand parameter. Increasing robustness influences the number of trucks for sending goods and products, caused consequently, increase the air pollution. In this paper, two green approaches are introduced which demand is the main uncertain parameter in both. These approaches are addressed to provide a trade-off b...
متن کاملProfit intensity criterion for transportation problems
In this study criterion of maximum profit intensity for transportation problems, in contrast to the known criteria of minimum expenses or minimum time for transportation, is considered. This criterion synthesizes financial and time factors and has real economic sense. According to the purpose of this paper, the algorithm of the solution of such a transportation problem is constructed. It is sho...
متن کاملA simplex algorithm for piecewise-linear fractional programming problems
Generalizations of the well-known simplex method for linear programming are available to solve the piecewise linear programming problem and the linear fractional programming problem. In this paper we consider a further generalization of the simplex method to solve piecewise linear fractional programming problems unifying the simplex method for linear programs, piecewise linear programs, and the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Operations Research
سال: 1996
ISSN: 0399-0559,1290-3868
DOI: 10.1051/ro/1996300100011